翻訳と辞書 Words near each other ・ FELDA Lok Heng ・ FELDA Mempaga ・ FELDA New Zealand ・ Felda Selasih ・ FELDA Soeharto ・ FELDA Taib Andak ・ Felda United F.C. ・ FELDA Waha ・ Felda, Florida ・ Feitian space suit ・ Feitiço ・ Feitosa ・ Feitosa River ・ Feitsui Dam ・ Feit–Thompson ・ Feit–Thompson conjecture ・ Feit–Thompson theorem ・ Feiurdeni River ・ Feixa Llarga ・ Feixi County ・ Feixia Middle School ・ Feixiang County ・ Feixiang Park Station ・ Feiyr ・ Feiyu Show ・ Feiyu Tech FY ・ Feiyue ・ Feiyue (Sewing) ・ Feiyun River ・ Feiz ha Breiz Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Feit–Thompson conjecture ： ウィキペディア英語版 Feit–Thompson conjecture In mathematics, the Feit–Thompson conjecture is a conjecture in number theory, suggested by . The conjecture states that there are no distinct prime numbers ''p'' and ''q'' such that :$\backslash frac$ divides $\backslash frac$. If the conjecture were true, it would greatly simplify the final chapter of the proof of the Feit–Thompson theorem that every finite group of odd order is solvable. A stronger conjecture that the two numbers are always coprime was disproved by with the counterexample ''p'' = 17 and ''q'' = 3313 with common factor 2''pq'' + 1 = 112643. Informal probability arguments suggest that the "expected" number of counterexamples to the Feit–Thompson conjecture is very close to 0, suggesting that the Feit–Thompson conjecture is likely to be true. ==See also== *Cyclotomic polynomials *Goormaghtigh conjecture 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Feit–Thompson conjecture」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.